翻訳と辞書 |
Algorithmic complexity : ウィキペディア英語版 | Algorithmic complexity Algorithmic complexity may refer to: * In algorithmic information theory, the complexity of a particular string, in terms of all algorithms that generate it. * * Kolmogorov–Chaitin complexity, the most widely-used such measure. * In analysis of algorithms, the complexity of a particular algorithm. * In computational complexity theory, the complexity of a particular problem, in terms of all algorithms that solve it.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Algorithmic complexity」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|